Projected Landweber method and preconditioning
نویسندگان
چکیده
منابع مشابه
Projected Landweber method and preconditioning
The projected Landweber method is an iterative method for solving constrained least-squares problems when the constraints are expressed in terms of a convex and closed set C. The convergence properties of the method have been recently investigated. Moreover, it has important applications to many problems of signal processing and image restoration. The practical difficulty is that the convergenc...
متن کاملPreconditioning Landweber iteration in Hilbert scales
In this paper we investigate convergence of Landweber iteration in Hilbert scales for linear and nonlinear inverse problems. As opposed to the usual application of Hilbert scales in the framework of regularization methods, we focus here on the case s ≤ 0, which (for Tikhonov regularization) corresponds to regularization in a weaker norm. In this case, the Hilbert scale operator L−2s appearing i...
متن کاملThe application of an oblique-projected Landweber method to a model of supervised learning
This report brings together a novel approach to some computer vision problems and a particular algorithmic development of the Landweber iterative algorithm. The algorithm solves a class of high-dimensional, sparse, and constrained least-squares problems, which arise in various computer vision learning tasks, such as object recognition and object pose estimation. The algorithm has recently been ...
متن کاملLandweber-kaczmarz Method in Banach Spaces with Inexact Inner Solvers
In recent years Landweber(-Kaczmarz) method has been proposed for solving nonlinear ill-posed inverse problems in Banach spaces using general convex penalty functions. The implementation of this method involves solving a (nonsmooth) convex minimization problem at each iteration step and the existing theory requires its exact resolution which in general is impossible in practical applications. I...
متن کاملA cyclic projected gradient method
In recent years, convex optimization methods were successfully applied for various image processing tasks and a large number of first-order methods were designed to minimize the corresponding functionals. Interestingly, it was shown recently in [25] that the simple idea of so-called “superstep cycles” leads to very efficient schemes for time-dependent (parabolic) image enhancement problems as w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inverse Problems
سال: 1997
ISSN: 0266-5611,1361-6420
DOI: 10.1088/0266-5611/13/2/016